Computability evaluation of RESTful API using Primitive Recursive Function
نویسندگان
چکیده
منابع مشابه
Non-primitive Recursive Function Definitions
This paper presents an approach to the problem of introducing non-primitive recursive function definitions in higher order logic. A recursive specification is translated into a domain theory version, where the recursive calls are treated as potentially non-terminating. Once we have proved termination, the original specification can be derived easily. A collection of algorithms are presented whi...
متن کاملSni'per: a Code Snippet RESTful API
Today we use the Web for almost everything, even to program. There are several specialized code editors gravitating on the Web and emulating most of the features inherited from traditional IDEs, such as, syntax highlight, code folding, autocompletion and even code refactorization. One of the techniques to speed the code development is the use of snippets as predefined code blocks that can be au...
متن کاملInvariance of Function Complexity Under Primitive Recursive Functions
Genetic Programming (GP) [1] often uses a tree form of a graph to represent solutions. An extension to this representation, Automatically Defined Functions (ADFs) [1] is to allow the ability to express modules. In [2] we proved that the complexity of a function is independent of the primitive set (function set and terminal set) if the representation has the ability to express modules. This is e...
متن کاملPrimitive Recursive Functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...
متن کاملExtended Primitive Recursive Functions
— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2018
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2018.11.014